On Optimal Route Computation of Mobile Sink in a Wireless Sensor Network

There is evidence of a range of sensor networks applications where a mobile sink entity (node) is utilised for data collection from statically positioned sensor nodes in a sensor field. The mobile sink is typically required to cover the sensor field by physical motion in order to obtain the values from the sensor nodes in a periodic fashion. This characteristic leads to a very interesting problem of determining the optimal route of the mobile sink, in terms of distance travelled, to accomplish the data collection from all the sensor nodes. This minimum distance problem that is spanned from the design nature of the network has very intriguing and motivating connections with a set of classic computational problems. These cohesions and similarities are explored in this paper, and the computational complexity is analysed. The applicability of numerical solutions to the current problem is discussed and a numerical heuristic is provided to arrive at an approximate answer that is 'close' to the actual solution. An evaluation of the proposed approach is also provided through experimental results

On sensor network segmentation for urban water distribution monitoring

Identifying water wastage in forms of leaks in a water distribution network of any city becomes essential as droughts are presenting serious threats to few major cities. In this paper, we propose a deployment of sensor network for monitoring water flow in any water distribution network. We cover the issues related with designing such a dedicated sensor network by considering types of sensors required, sensors' functionality, data collection, and providing computation serving as leak detection mechanism. The main focus of this paper is on appropriate network segmentation that provides the base for hierarchical approach to pipes' failure detection. We show a method for sensors allocation to the network in order to facilitate effective pipes monitoring. In general, the identified computational problem belongs to hard problems. The paper shows a heuristic method to build effective hierarchy of the network segmentation

ON EFFICIENT VALIDATION AND CONSTRUCTION OF SMOOTH AND RELIABLE SENSOR NETWORKS BY VIRTUAL WIRING

The use of wireless sensor networks is gathering momentum in recent days owing to its service in effectively assisting the expansion of the computing process from fixed terminals of computers to the real world. There are numerous issues involved in the operation of sensor networks spanning electronics, communication and data management. However, energy constraints play a dominant role in almost all considerations. In this paper, we suggest a method to reduce energy wastage by avoiding unwanted transmissions and then validating the network for two key features namely, reliability and smoothness of data flow. The former gives the network the ability to function with knode failure and the latter provides a logical closeness to nodes that are physically close. The network can be rendered virtually wired by exploiting the choice of communication channels between nodes and then validated for the desired features and subsequently amended if the conditions are not met. 1